Forms of Determinism for Automata∗
نویسنده
چکیده
We survey in this paper some variants of the notion of determinism, refining the spectrum between non-determinism and determinism. We present unambiguous automata, strongly unambiguous automata, prophetic automata, guidable automata, and history-deterministic automata. We instantiate these various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions. The main results are underlined and some open problems proposed. 1998 ACM Subject Classification F.1.1 Models of Computation, F.1.2 Modes of Computation, F.4.3 Formal Languages
منابع مشابه
Schloss Dagstuhl – Leibniz-Center for Informatics GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,
We survey in this paper some variants of the notion of determinism, refining the spectrum betweennon-determinism and determinism. We present unambiguous automata, strongly unambiguousautomata, prophetic automata, guidable automata, and history-deterministic automata. Weinstantiate these various notions for finite words, infinite words, finite trees, infinite trees, datalanguages...
متن کاملWatson-Crick automata: determinism and state complexity
Watson-Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity of Watson-Crick automata initiated in [9]. In particular, we show that any finite language as well as any unary regular language can be recognized by a Watson-Crick autom...
متن کاملCausal automata
We introduce causal automata, a formalism based on a syntactic approach to causality in contrast to conventional approaches based on partial orders. Our main result is the following characterisation of Milner’s notion of confluence in CCS: Confluence ≡ Determinism + {AND,OR} Causality.
متن کاملDeterministic Automata for Unordered Trees
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficien...
متن کاملThe Generalization of Generalized Automata: Expression Automata
We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano’s definition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We...
متن کامل